Three-dimensional Straight Skeletons from Bisector Graphs
نویسنده
چکیده
A straight skeleton of a polygon or of a polytope is a piecewise linear skeletal structure that partitions the underlying object by means of a self-parallel shrinking process. We propose a method for constructing different straight skeletons for a given nonconvex polytope Q in 3-space. The approach is based on so-called bisector graphs on the sphere, and allows for generating straight skeletons with certain optimality properties. The various events that arise during the process of shrinking Q are discussed. We have implemented our method and give some examples of the output.
منابع مشابه
Bisector Graphs for Min-/Max-Volume Roofs over Simple Polygons
Piecewise-linear terrains (“roofs”) over simple polygons were studied by Aichholzer et al. (1995) in their work on straight skeletons of polygons. We show how to construct a roof over a simple polygon that has minimum (or maximum) volume among all roofs that drain water. Such a maximum-volume (minimumvolume) roof can have quadratic (maybe cubic, resp.) number of facets. Our algorithm for comput...
متن کاملComputing straight skeletons of planar straight-line graphs based on motorcycle graphs
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introduce a wavefront-propagation algorithm that circumvents the expensive search for the next split event. Our algorithm maintains the simplicity of the triangulation-based algorithm by Aichholzer and Aurenhammer but has a ...
متن کاملDiscrete bisector function and Euclidean skeleton in 2D and 3D
We propose a new definition and an algorithm for the discrete bisector function, which is an important tool for analyzing and filtering Euclidean skeletons. We also introduce a new thinning algorithm which produces homotopic discrete Euclidean skeletons. These algorithms, which are valid both in 2D and 3D, are integrated in a skeletonization method which is based on exact transformations, allow...
متن کاملApproximating a Motorcycle Graph by a Straight Skeleton
We investigate how a straight skeleton can be used to approximate a motorcycle graph. We explain how to construct a planar straight-line graph G such that the straight skeleton of G reveals the motorcycle graph of M , for every given finite set M of motorcycles. An application of our construction is a proof of the Pcompleteness of the construction problem of straight skeletons of planar straigh...
متن کاملA Fast Straight-Skeleton Algorithm Based on generalized Motorcycle Graphs
This paper deals with the fast computation of straight skeletons of planar straightline graphs (PSLGs) at an industrial-strength level. We discuss both the theoretical foundations of our algorithm and the engineering aspects of our implementation Bone. Our investigation starts with an analysis of the triangulation-based algorithm by Aichholzer and Aurenhammer and we prove the existence of flip-...
متن کامل